Matrix Graph Grammars with Application Conditions
نویسندگان
چکیده
منابع مشابه
Matrix Graph Grammars with Application Conditions
In the Matrix approach to graph transformation we represent simple digraphs and rules with Boolean matrices and vectors, and the rewriting is expressed using Boolean operators only. In previous works, we developed analysis techniques enabling the study of the applicability of rule sequences, their independence, state reachability and the minimal graph able to fire a sequence. In the present pap...
متن کاملGraph Grammars with Negative Application Conditions
In each graph-grammar approach it is deened how and under which conditions graph productions can be applied to a given graph in order to obtain a derived graph. The conditions under which productions can be applied are called application conditions. Although the generative power of most of the known general graph-grammar approaches is suucient to generate any recursively enumerable set of graph...
متن کاملMatrix Graph Grammars
This book objective is to develop an algebraization of graph grammars. Equivalently, we study graph dynamics. From the point of view of a computer scientist, graph grammars are a natural generalization of Chomsky grammars for which a purely algebraic approach does not exist up to now. A Chomsky (or string) grammar is, roughly speaking, a precise description of a formal language (which in essenc...
متن کاملApplication-oriented Spatial Graph Grammars
The Reserved Graph Grammar (RGG) is a general graph grammar Jormalism that expresses a wide range oj visual languages, This paper presents an extension to RGG with the capability oj spatial specification, Graph transJormation satisfying the spatial specification can be performed in the process oj parsing. The RGG with spatial specification can be applied to various types oj applications, The pa...
متن کاملPetri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to Petri nets, especially to reachability criteria. Second, the state equation and related algebraic Petri net techniques for reachability are generalized using tensor algebra to cover a wider class of rewriting systems....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2010
ISSN: 0169-2968
DOI: 10.3233/fi-2010-238